Discounted Stochastic Games

نویسنده

  • Eilon Solan
چکیده

We give an alternative proof to a result of Mertens and Parthasarathy, stating that every n-player discounted stochastic game with general setup, and with a norm-continuous transition, has a subgame perfect equilibrium. † Institute of Mathematics and Center for Rationality and Interactive Decision Theory, The Hebrew University, Givat Ram, 91904 Jerusalem, Israel. e-mail: [email protected] This paper is part of the Master thesis of the author done with Prof. Ehud Lehrer in Tel Aviv University. I would like to thank Prof. Lehrer for many discussions and ideas and for the continuous help he offered. My gratitude is also given to Abraham Neyman, Sergiu Hart and J.F. Mertens for the discussions we had on the subject. I deeply thank the associate editor and two anonymous referees for many comments which substantially improved the paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Corrigendum to: “Discounted Stochastic Games with No Stationary Nash Equilibrium: Two Examples”

Levy (2013) presents examples of discounted stochastic games that do not have stationary equilibria. The second named author has pointed out that one of these examples is incorrect. In addition to describing the details of this error, this note presents a new example by the first named author that succeeds in demonstrating that discounted stochastic games with absolutely continuous transitions ...

متن کامل

Discounted Robust Stochastic Games and an Application to Queueing Control

This paper presents a robust optimization model for n-person finite state/action stochastic games with incomplete information. We consider nonzero sum discounted stochastic games in which none of the players knows the true data of a game, and each player adopts a robust optimization approach to address the uncertainty. We call these games discounted robust stochastic games. Such games allow us ...

متن کامل

Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-run Average Objectives

Turn-based stochastic games and its important subclass Markov decision processes (MDPs) provide models for systems with both probabilistic and nondeterministic behaviors. We consider turnbased stochastic games with two classical quantitative objectives: discounted-sum and long-run average objectives. The game models and the quantitative objectives are widely used in probabilistic verification, ...

متن کامل

Blackwell Optimal Strategies in Priority mean-Payoff Games

One of the recurring themes in the theory of stochastic games is the interplay between discounted games and mean-payoff games. This culminates in the seminal paper of Mertens and Neyman [12] showing that mean-payoff games have a value and this value is the limit of the values of discounted games when the discount factor tends to 1. Note however that optimal strategies in both games are very dif...

متن کامل

Finite-step Algorithms for Single-controller and Perfect Information Stochastic Games

After a brief survey of iterative algorithms for general stochastic games, we concentrate on finite-step algorithms for two special classes of stochastic games. They are Single-Controller Stochastic Games and Perfect Information Stochastic Games. In the case of single-controller games, the transition probabilities depend on the actions of the same player in all states. In perfect information st...

متن کامل

Reversibility and Oscillations in Zero-sum Discounted Stochastic Games

We show that by coupling two well-behaved exit-time problems one can construct two-person zero-sum stochastic games with finite state space having oscillating discounted values. This unifies and generalizes recent examples due to Vigeral (2013) and Ziliotto (2013).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1998